Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Source URL: www.cs.tufts.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Set cover problem
• Approximation algorithm
• Facility location problem
• Dominating set
• Combinatorial optimization
• Reduction
• Algorithm

Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2

Source URL: community.dur.ac.uk

• Graph theory
• Mathematics
• Graph coloring
• Degree
• Graph
• Eulerian path
• Ear decomposition
• NP-complete problems
• Graph operations
• Dominating set
• Incidence coloring

CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Mathematics
• Computational complexity theory
• Graph theory
• NP-complete problems
• Operations research
• Travelling salesman problem
• Theoretical computer science
• Approximation algorithm
• Steiner tree problem
• Greedy algorithm
• Optimization problem
• Set cover problem

Use Case Grok leverages custom automation to troubleshoot anomalous behavior. An EC2 server running an e-commerce application shows an anomalous pattern of activity in the middle of the night. The operations team has set

Source URL: grokstream.com

• Computing
• Information technology management
• Deep learning
• Numenta
• Grok
• ServiceNow
• Information technology
• Linguistics

Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004

Source URL: disco.ethz.ch

• Graph theory
• NP-complete problems
• Graph
• Graph coloring
• Planar graph
• Dominating set
• Connectivity
• Graph operations
• Planar separator theorem

FIRST GRADE MATH JOURNAL QUESTIONS 4 Aug, 2016 | PDF-COUS5FGMJQ12 | Pages: 35 | Size 1,619 KB TABLE OF CONTENT Introduction

Source URL: conservative-voice.us

• Operations research
• Combinatorics
• Design of experiments
• Group testing
• Rough set

Management´s discussion and analysis of finacial condition and results of operations Set forth below are our consolidated results for the years ended December 31, 2013 andAs required by regulations issued by Comi

Source URL: i2.esmas.com

A Truthful-in-expectation Mechanism for the Generalized Assignment Problem Salman Fadaei and Martin Bichler Department of Informatics, TU München, Munich, Germany ,

Source URL: dss.in.tum.de

• Game theory
• Convex optimization
• Linear programming
• Operations research
• Mechanism design
• Expected value
• VickreyClarkeGroves auction
• Submodular set function

A grammatical approach to mine detection Christopher Raphael Stuart Gemany March 25, 1997

Source URL: music.informatics.indiana.edu

• Convex analysis
• Operations research
• Mathematical optimization
• Convex geometry
• Convex set
• Convex function
• Dynamic programming
• Algorithm
• ShapleyFolkman lemma
• Transportation theory

CS261: Exercise Set #4 For the week of January 25–29, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Linear programming
• Convex optimization
• Operations research
• Mathematical optimization
• Combinatorial optimization
• Duality
• Weak duality
• Ellipsoid method
• Semidefinite programming